Estimating the Minimal Length of Tardos Code
نویسندگان
چکیده
This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetric accusation function as improved by B. Skoric et al. The length estimation is based on two pillars. First, we consider the Worst Case Attack that a group of c colluders can lead. This attack minimizes the mutual information between the code sequence of a colluder and the pirated sequence. Second, an algorithm pertaining to the field of rare event analysis is presented in order to estimate the probabilities of error: the probability that an innocent user is framed, and the probabilities that all colluders are missed. Therefore, for a given collusion size, we are able to estimate the minimal length of the code satisfying some error probabilities constraints. This estimation is far lower than the known lower bounds.
منابع مشابه
Optimization of Memory Usage in Tardos's Fingerprinting Codes
It is known that Tardos’s collusion-secure probabilistic fingerprinting code (Tardos code; STOC’03) has length of theoretically minimal order with respect to the number of colluding users. However, Tardos code uses certain continuous probability distribution in codeword generation, which creates some problems for practical use, in particular, it requires large extra memory. A solution proposed ...
متن کاملImproved versions of Tardos' fingerprinting scheme
We study the Tardos’ probabilistic fingerprinting scheme and show that its codeword length may be shortened by a factor of approximately 4. We achieve this by retracing Tardos’ analysis of the scheme and extracting from it all constants that were arbitrarily selected. We replace those constants with parameters and derive a set of inequalities that those parameters must satisfy so that the desir...
متن کاملOn the Design and Optimization of Tardos Probabilistic Fingerprinting Codes
G. Tardos [1] was the first to give a construction of a fingerprinting code whose length meets the lowest known bound inO(c log n 1 ). This was a real breakthrough because the construction is very simple. Its efficiency comes from its probabilistic nature. However, although G. Tardos almost gave no argument of his rationale, many parameters of his code are precisely fine-tuned. This paper propo...
متن کاملBinary and q-ary Tardos codes, revisited
The Tardos code is a much studied collusion-resistant fingerprinting code, with the special property that it has asymptotically optimal length m ∝ c0, where c0 is the number of colluders. In this paper we give alternative security proofs for the Tardos code, working with the assumption that the strongest coalition strategy is position-independent. We employ the Bernstein inequality and Bennett ...
متن کاملSymmetric Tardos fingerprinting codes for arbitrary alphabet sizes
Fingerprinting provides a means of tracing unauthorized redistribution of digital data by individually marking each authorized copy with a personalized serial number. In order to prevent a group of users from collectively escaping identi cation, collusion-secure ngerprinting codes have been proposed. In this paper, we introduce a new construction of a collusion-secure ngerprinting code which is...
متن کامل